0 M ar 2 00 4 Enumeration of Symmetry Classes of Convex Polyominoes on the Honeycomb Lattice ∗
نویسنده
چکیده
Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the generating series of free (i.e. up to reflection and rotation) and of asymmetric convex hexagonal polyominoes, according to area and half-perimeter. We give explicit formulas or implicit functional equations for the generating series, which are convenient for computer algebra.
منابع مشابه
Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice
Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the generating series of free (i.e. up to reflection and rotation) and of asymmetric convex hexagonal polyominoes, according to area and half-perimeter. We give explici...
متن کاملEnumeration of Symmetry Classes of Convex Polyominoes in the Square Lattice
This paper concerns the enumeration of rotation-type and congruence-type convex polyominoes on the square lattice. These can be defined as orbits of the groups C4, of rotations, and D4, of symmetries, of the square, acting on (translation-type) polyominoes. In virtue of Burnside’s Lemma, it is sufficient to enumerate the various symmetry classes (fixed points) of polyominoes defined by the elem...
متن کاملA Bijection for Directed-Convex Polyominoes
In this paper we consider two classes of lattice paths on the plane which use north, east, south, and west unitary steps, beginning and ending at 0 0 . We enumerate them according to the number of steps by means of bijective arguments; in particular, we apply the cycle lemma. Then, using these results, we provide a bijective proof for the number of directed-convex polyominoes having a fixed num...
متن کاملar X iv : 0 71 1 . 05 82 v 1 [ m at h . C O ] 5 N ov 2 00 7 PERMUTATIONS DEFINING CONVEX PERMUTOMINOES
A permutomino of size n is a polyomino determined by particular pairs (π1, π2) of permutations of size n, such that π1(i) 6= π2(i), for 1 ≤ i ≤ n. Here we determine the combinatorial properties and, in particular, the characterization for the permutations defining convex permutominoes. Using such a characterization, these permutations can be uniquely represented in terms of the so called square...
متن کامل0 Statistics of lattice animals ( polyominoes ) and polygons
We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, τ = 4.062570(8), for the growth constant of lattice animals and confirms to a very high degree of certainty that the generating function has a logarithmic divergence. We prove the bound τ >...
متن کامل